Performance Heterogeneity and Approximate Reasoning in Description Logic Ontologies Rafael S. Gon¸calves, Bijan Parsia, and Uli Sattler School of Computer Science University of Manchester Manchester, United Kingdom

Source URL: www.rsgoncalves.com

LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Logic in computer science
• Clique problem
• Boolean circuit
• Clique
• Circuit
• ACC0
• NC

c Cambridge University Press 2009 JFP: page 1 of 24.  1 doi:S0956796809990219

Source URL: www.cs.ioc.ee

• Logic in computer science
• Programming language semantics
• Models of computation
• Computability theory
• Logic programming
• Substitution
• Operational semantics
• Denotational semantics
• Lambda calculus
• Structure

Rewriting, Inference, and Proof? Appears in the Proceedings of the 8th Workshop on Rewriting Logic and its Applications, 2010 Natarajan Shankar1 Computer Science Laboratory

Source URL: www.csl.sri.com

Denotational semantics for lazy initialization of letrec black holes as exceptions rather than divergence Keiko Nakata Institute of Cybernetics at Tallinn University of Technology Abstract We present a denotational seman

Source URL: www.cs.ioc.ee

• Theoretical computer science
• Models of computation
• Mathematical logic
• Software engineering
• Computability theory
• Denotational semantics
• Logic in computer science
• Lambda calculus
• Substitution
• Function type

Logic Programs, Iterated Function Systems, and Recurrent Radial Basis Function Networks Sebastian Bader and Pascal Hitzler∗ Artificial Intelligence Institute Department of Computer Science

Source URL: daselab.cs.wright.edu

A comparative study of programmer-written and automatically inferred contracts Nadia Polikarpova, Ilinca Ciupa, Bertrand Meyer Chair of Software Engineering, ETH Zurich, Switzerland {firstname.lastname}@inf.ethz.ch

Source URL: se.ethz.ch

• Software engineering
• Computer programming
• Software
• Formal methods
• Logic in computer science
• Object-oriented programming languages
• Object-oriented programming
• Software testing
• Postcondition
• Eiffel
• Assertion
• Class invariant

M EMORAX, a precise and sound tool for automatic fence insertion under TSO ? Parosh Aziz Abdulla1 , Mohamed Faouzi Atig1 , Yu-Fang Chen2 , Carl Leonardsson1 , and Ahmed Rezine3 1

Source URL: user.it.uu.se

• Theoretical computer science
• Mathematics
• Finite automata
• Computing
• Theory of computation
• Formal methods
• Reachability problem
• Logic in computer science
• Model checking
• Memory barrier
• Preorder
• Algorithm

POSH - The Prolog OWL Shell Chris Mungall Abstract. Two of the most common ways of processing and manipulating OWL ontologies are through an ontology editing environment (e.g. Protege or TopBraid) or via a programmatic i

Source URL: webont.org

• Semantic Web
• Resource Description Framework
• Information science
• Knowledge engineering
• Knowledge representation
• Web Ontology Language
• Semantic reasoner
• Prolog
• Description logic
• Ontology
• Jena
• SPARQL

Between two and four values Adam Pˇrenosil Institute of Computer Science, Czech Academy of Sciences Department of Logic, Faculty of Arts, Charles University 4th Prague Gathering of Logicians

Source URL: prague_logic_2016.math.cas.cz